Efficient RNS to binary converters for the new 4-moduli set {2n, 2n+1-1, 2n-1, 2n-1-1}
نویسندگان
چکیده
منابع مشابه
Memoryless RNS-to-binary converters for the {2n+1 - 1, 2n, 2n - 1} moduli set
In this paper, we propose two novel memoryless reverse converters for the moduli set {2 − 1, 2, 2 − 1}. The first proposed converter does not entirely cover the dynamic range while the second proposed converter covers the entire dynamic range. First, we simplify the Chinese Remainder Theorem in order to obtain a reverse converter that utilizes mod-(2 − 1) operation. Second, we further reduce th...
متن کاملResidue-to-binary arithmetic converter for moduli set {2n -1, 2n, 2n+1, 2n+1 -1}
This paper presents a new reverse converter architecture for the moduli set { 2 -1, 2, 2 +1, 2-1}. It exploits the special properties of the numbers of the form 1 2 ± , and extends the dynamic range of the present triple moduli based systems. Here we use a combination of CRT and MRC for reverse conversion. With a pipelined system the throughput rate is that of a single 3n+1 bit binary adder delay.
متن کاملFast Sign Detection Algorithm for the RNS Moduli Set 2n+1-1, 2n-1, 2n
This brief presents a fast sign detection algorithm for the residue number system moduli set {2n+1 − 1, 2n − 1, 2n}. First, a sign detection algorithm for the restricted moduli set is described. The new algorithm allows for parallel implementation and consists exclusively of modulo 2n additions. Then, a sign detection unit for the moduli set {2n+1 − 1, 2n − 1, 2n} is proposed based on the new s...
متن کاملA reverse converter for the new 4-moduli set {2n + 3, 2n + 2, 2n + 1, 2n}
In this paper, we propose a new 4-moduli set {2n+ 3, 2n+ 2, 2n+ 1, 2n} that increases the dynamic range and the processing parallelism enabling efficient reverse conversion. First, we assume a general 4-moduli set {mi}i=1,4, m1 > m2 > m3 > m4, with the dynamic range M = ∏4 i=1 mi and introduce a modified Chinese Remainder Theorem (CRT) that requires mod-m4 instead of mod-M calculations. Subsequ...
متن کاملAn improved RNS reverse converter for the {22n+1-1, 2n, 2n-1} moduli set
In this paper, we propose a novel high speed memoryless reverse converter for the moduli set {22n+1 − 1,2n,2n − 1}. First, we simplify the traditional Chinese Remainder Theorem in order to obtain a reverse converter that only requires arithmetic mod-(22n+1 − 1). Second, we further improve the resulting architecture to obtain a reverse converter that only uses Carry Save Adders and Carry Propaga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2012
ISSN: 1349-2543
DOI: 10.1587/elex.9.1